Learning automata-based algorithms for solving stochastic minimum spanning tree problem
نویسندگان
چکیده
منابع مشابه
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
Due to the hardness of solving the minimum spanning tree (MST) problem in stochastic environments, the stochastic MST (SMST) problem has not received the attention it merits, specifically when the probability distribution function (PDF) of the edge weight is not a priori known. In this paper, we first propose a learning automata‐based sampling algorithm (Algorithm 1) to solve the MST problem in...
متن کاملStochastic Inverse Minimum Spanning Tree Problem†
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the stochastic inverse minimum spanning tree problem is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tree model and a pro...
متن کاملSolving Minimum Steiner Tree Problem Using Generalized Distributed Learning Automata
Minimum Steiner tree problem in a weighted graph is to find a least cost sub tree in the graph such that it contains special vertices called terminal points. Since this problem belongs to NP-Complete problems, many approximate algorithms including genetic algorithms and ant colony strategies have been designed for solving it. In this paper, we propose an algorithm based on distributed learning ...
متن کاملEvaluating Minimum Spanning Tree Based Segmentation Algorithms
Two segmentation methods based on the minimum spanning tree principle are evaluated with respect to each other. The hierarchical minimum spanning tree method is also evaluated with respect to human segmentations. Discrepancy measure is used as best suited to compute the segmentation error between the methods. The evaluation is done using gray value images. It is shown that the segmentation resu...
متن کاملHeuristic Algorithms for the Generalized Minimum Spanning Tree Problem
We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them based on Prim’s and Kruskal’s algorithms for the minimum spanning tree problem and one based on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2011
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2011.02.017